Hats, auctions and derandomization

Hats, auctions and derandomization

We investigate derandomizations of digital good randomized auctions. We propose a general derandomization method which can be used to show that for every random auction there exists a deterministic auction having asymptotically the same revenue. In addition, we construct an explicit optimal deterministic auction for bi-valued auctions.

A New Derandomization of Auctions

Let A be a randomized, unlimited supply, unit demand, single-item auction, which given a bid-vector b ∈ [h], has expected profit E[P (b)]. Aggarwal et al. showed that given A, there exists a deterministic auction which given a bid-vector b, guarantees a profit of E[P (b)]/4 − O(h). In this paper we show that given A, there exists a deterministic auction which given a bid-vector b of length n, g...

Pairwise Independence and Derandomization Pairwise Independence and Derandomization

This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the algorithm do not come from the uniform distribution, but rather from a...

44 Randomization and Derandomization

FRAMEWORK AND ANALYSIS Most randomized incremental algorithms in the literature follow the framework sketched here for the computation of the trapezoidal map: the structure to be computed is maintained while the objects defining it are inserted in random order. To insert a new object, one first has to find a “conflict” of that object (the location step), then local updates in the structure are ...

Randomization and derandomization